Kriging-based subdivision schemes: Application to the reconstruction of non-regular environmental data

نویسندگان

  • Jean Baccou
  • Jacques Liandrat
چکیده

This work is devoted to the construction of new kriging-based interpolating position-dependent subdivision schemes for data reconstruction. Their originality stands in the coupling of the underlying multi-scale framework associated to subdivision schemes with kriging theory. Thanks to an efficient stencil selection, they allow to cope the problem of non-regular data prediction while keeping the interesting properties of kriging operators for the quantification of prediction errors. The proposed subdivision schemes are fully analyzed and an application to the reconstruction of non-regular environmental data is given as well.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spline Subdivision Schemes for Convex Compact Sets

The application of spline subdivision schemes to data consisting of convex compact sets with addition replaced by Minkowski sums of sets is investigated These methods generate in the limit set valued functions which can be expressed explicitly in terms of linear com binations of integer shifts of B splines with the initial data as coe cients The subdivision techniques are used to conclude that ...

متن کامل

The comparison of two high-order semi-discrete central schemes for solving hyperbolic conservation laws

This work presents two high-order, semi-discrete, central-upwind schemes for computing approximate solutions of 1D systems of conservation laws. We propose a central weighted essentially non-oscillatory (CWENO) reconstruction, also we apply a fourth-order reconstruction proposed by Peer et al., and afterwards, we combine these reconstructions with a semi-discrete central-upwind numerical flux ...

متن کامل

Neural Network Residual Kriging Application for Climatic Data

Direct Neural Network Residual Kriging (DNNRK) is a two step algorithm (Kanevsky et al. 1995). The first step includes estimating large scale structures by using artificial neural networks (ANN) with simple sum of squares error function. ANN, being universal approximators, model overall non-linear spatial pattern fairly well. ANN are model free estimators and depend only on their architecture a...

متن کامل

Generalized Catmull-Clark Subdivision

The Catmull-Clark subdivision algorithm consists of an operator that can be decomposed into a refinement operator and a successively executed smoothing operator, where the refinement operator splits each face with m vertices into m quadrilateral subfaces and the smoothing operator replaces each internal vertex with an affine combination of its neighboring vertices and itself. Over regular meshe...

متن کامل

Volume-Surface Trees

Many algorithms in computer graphics improve their efficiency by using Hierarchical Space Subdivision Schemes (HS3), such as octrees, kD-trees or BSP trees. Such HS3 usually provide an axis-aligned subdivision of the 3D space embedding a scene or an object. However, the purely volume-based behavior of these schemes often leads to strongly imbalanced surface clustering. In this article, we intro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Mathematics and Computers in Simulation

دوره 81  شماره 

صفحات  -

تاریخ انتشار 2011